A complementary survey on double-loop networks
نویسندگان
چکیده
منابع مشابه
A complementary survey on double-loop networks
We give a survey on double-loop networks with emphasis on new development since the surveys in 1986, 1991 and 1995. c © 2001 Elsevier Science B.V. All rights reserved.
متن کاملEquivalent Double - Loop Networks
Hwang and Xu defined equivalent double-loop networks and gave one such result showing that the L-shapes of the two equivalent networks are recombinations of three rectangles. Recently, Rödseth gave an elegant algebraic theorem for equivalent multi-loop networks. We show that its double-loop version yields equivalent networks of the 3rectangle version. We also show that other seemingly different...
متن کاملA Survey on Stability Measure of Networks
In this paper we discuss about tenacity and its properties in stability calculation. We indicate relationships between tenacity and connectivity, tenacity and binding number, tenacity and toughness. We also give good lower and upper bounds for tenacity.
متن کاملA symbolical algorithm on additive basis and double-loop networks
A double-loop digraph G=G(N ; s1; s2), with gcd(N; s1; s2)=1, has the set of vertices V =ZN and the adjacencies are given by u → u + si (mod N ) i = 1; 2. The diameter of G, denoted by D(N ; s1; s2), is known to be lower bounded by lb(N ) with D(N ) = min 16s1¡s2¡N; gcd(N;s1 ; s2)=1 D(N ; s1; s2)¿ ⌈√ 3N ⌉ − 2 = lb(N ): This lower bound is known to be sharp. For a 0xed N ∈N, some algorithms to 0...
متن کاملDistributed Loop Computer Networks: A Survey
Distributed loop computer networks are extensions of the ring networks and are widely used in the design and implementation of local area networks and parallel processing architectures. We give a survey of recent results on this class of interconnection networks. We pay special attention to the actual computation of the minimum diameter and the construction of loop networks which can achieve th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2001
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00243-7